Comparison on Different Load Balancing Algorithms of Peer to Peer Networks

نویسندگان

  • K. N. Sirisha
  • S. Bhagya Rekha
چکیده

Load balancing is the process of improving the performance of a peer to peer networks through a redistribution of load among the processors. In this paper we present the performance analysis of various load balancing algorithms based on different parameters, considering two typical load balancing approaches static and dynamic. The analysis indicates that static and dynamic both types of algorithm can have advancements as well as weaknesses over each other. Deciding type of algorithm to be implemented will be based on type of parallel applications to solve. The main purpose of this paper is to help in design of new algorithms in future by studying the behavior of various existing algorithms. KeywordsPeer to Peer networks, Load Balancing Algorithms. Distributed systems

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Structured Peer-to-Peer Systems using Load Balancing with Imperfect Information

with the notion of virtual servers, peers participating in a heterogeneous, structured peer-to-peer (P2P) network may host different numbers of virtual servers, and by migrating virtual servers, peers can balance their loads proportional to their capacities. The existing and decentralized load balance algorithms designed for the heterogeneous, structured P2P networks either explicitly construct...

متن کامل

Arbitrary Selection for Agitate Flexible Load Balancing in Heterogeneous Peer to Peer Networks

Peer to Peer Network access is the integral part of the day to day business for most of the computer users. Preserving load balance on heterogeneous peer to peer networks is a challenging purpose and several existing works presented load redistribution algorithms for load division and load diversions at the instance the new peer enters. The aim of load balancing in P2P networks is to equilibriu...

متن کامل

Diffusive Load Balancing of Loosely-Synchronous Parallel Programs over Peer-to-Peer Networks

The use of under-utilized Internet resources is widely recognized as a viable form of high performance computing. Sustained processing power of roughly 40T FLOPS using 4 million volunteered Internet hosts has been reported for embarrassingly parallel problems. At the same time, peer-to-peer (P2P) file sharing networks, with more than 50 million participants, have demonstrated the capacity for s...

متن کامل

3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs

Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks featu...

متن کامل

Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems

Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalable and self-organizing approach for efficient and persistent distribution and retrieval of data. However the scalability and performance of DHTs is strongly based on an equal distribution of data across participating nodes. Beca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012